package cn.pugle.oj.leetcode;

import cn.pugle.oj.catalog.DynamicProblem;

import java.util.Arrays;

/**
 * TODO
 *
 * @author tzp
 * @since 2020/9/18
 */
public class LC188 implements DynamicProblem {
    public int maxProfit(int k, int[] prices) {
        int n = prices.length;
        if (k <= 0 || n <= 1) return 0;
        int[][] state = new int[n][n];
        int max = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < k; j++) {

            }
        }
        return 1;
    }

    public static void main(String[] args) {
        System.out.println(new LC188().maxProfit(2, new int[]{7, 1, 5, 3, 6, 4}));
        System.out.println(new LC188().maxProfit(2, new int[]{7, 6, 5, 4}));
        System.out.println(new LC188().maxProfit(2, new int[]{7, 6, 5, 4, 5}));
        System.out.println(new LC188().maxProfit(2, new int[]{4, 3, 7, 6, 10, 1, 3, 2, 3}));
    }
}
